1766A - Extremely Round - CodeForces Solution

#include <bits/stdc++.h>
#include <cstdint>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef pair<string, string> pss;
typedef map<int, int> mii;
typedef map<ll, ll> mll;
typedef map<string, ll> msl;
typedef map<string, string> mss;

#define FAST                          \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
#define pb push_back
#define pf push_front

#define fi first
#define se second
#define in insert
#define mp make_pair
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repr(i, n, b) for (ll i = n; i > b; i--)
#define repv(v) for (auto x : v)
#define all(v) v.begin(), v.end()
#define mem(a, b) memset(a, b, sizeof a)
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define sz(v) ll(v.size())
#define mod 1000000007

vector<ll> mergeInterval(vector<ll> a,vector<ll> b){
    if(a[1] < b[0] || b[1] < a[0]) return {-1,-1};
    a[0]=max(a[0] , b[0]);
    a[1] = min(a[1] ,b[1]);

    return a;
}



int main()
{
    FAST;

    ll t = 1;
    cin >> t;
    while (t--)
    {
        ll n;
        cin>>n;
        string num=to_string(n);
        int len=num.length();
        ll ans=0;
        for(ll ch=1;ch<=9;ch++){
            ll t=ch;
            for(int i=0;i<=len;i++){
                if(t <= n){
                    ans++;
                }
                t*=10;
            }
            
        }
        cout<<ans;
        cout<<endl;
    }
    return 0;
}